Satoh ' S Algorithm in Characteristic 2 Berit
نویسنده
چکیده
We give an algorithm for counting points on arbitrary ordinary elliptic curves over finite fields of characteristic 2, extending the O(log q) method given by Takakazu Satoh, giving the asymptotically fastest point counting algorithm known to date.
منابع مشابه
Satoh's algorithm in characteristic 2
We give an algorithm for counting points on arbitrary ordinary elliptic curves over finite fields of characteristic 2, extending the O(log q) method given by Takakazu Satoh, giving the asymptotically fastest point counting algorithm known to date.
متن کاملA Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2
Since the first use of a p-adic method for counting points of elliptic curves, by Satoh in 1999, several variants of his algorithm have been proposed. In the current state, the AGM algorithm, proposed by Mestre is thought to be the fastest in practice, and the algorithm by Satoh–Skjernaa–Taguchi has the best asymptotic complexity but requires precomputations. We present an amelioration of the S...
متن کاملThe AGM-X0(N) Heegner Point Lifting Algorithm and Elliptic Curve Point Counting
We describe an algorithm, AGM-X0(N), for point counting on elliptic curves of small characteristic p using p-adic lifts of their invariants associated to modular curves X0(N). The algorithm generalizes the contruction of Satoh [10], SST [11], and Mestre [9]. We describe this method and give details of its implementation for characteristics 2, 3, 5, 7, and 13.
متن کاملFinding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known for random curves. Then Satoh proposed a new algorithm based on the canonical p-adic lift of the curve for p ≥ 5. In an earlier paper, the authors extended Satoh’s method to the case of characteristics two and three. ...
متن کاملProviding A New Characteristic for Overcurrent Relays
This with the integration of distributed generation (DG) to meshed distribution systems, the operating time of the protective system becomes a major concern in order to avoid nuisance DG tripping. This paper proposes a new tripping characteristic for directional overcurrent relays (DOCRs) that can achieve a higher possible reduction of overall relays operating time in meshed distribution networ...
متن کامل